The Lanczos Method for Parameterized Symmetric Linear Systems with Multiple Right-Hand Sides
نویسندگان
چکیده
منابع مشابه
The Lanczos Method for Parameterized Symmetric Linear Systems with Multiple Right-Hand Sides
The solution of linear systems with a parameter is an important problem in engineering applications, including structural dynamics, acoustics, and electronic circuit simulations, and in related model order reduction methods such as Padé via Lanczos. In this paper, we present a Lanczos-based method for solving parameterized symmetric linear systems with multiple right-hand sides. We show that fo...
متن کاملthe block lsmr method: a novel efficient algorithm for solving non-symmetric linear systems with multiple right-hand sides
it is well known that if the coefficient matrix in a linear system is large and sparse or sometimes not readily available, then iterative solvers may become the only choice. the block solvers are an attractive class of iterative solvers for solving linear systems with multiple right-hand sides. in general, the block solvers are more suitable for dense systems with preconditioner. in this paper,...
متن کاملDeflated and Restarted Symmetric Lanczos Methods for Eigenvalues and Linear Equations with Multiple Right-Hand Sides
A deflated restarted Lanczos algorithm is given for both solving symmetric linear equations and computing eigenvalues and eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Meanwhile, the deflating from the presence of the eigenvectors allows the linear equations to generally have good convergence in spite of the restarting. Some reorthogonalization is ne...
متن کاملExtending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
The technique that was used to build the eigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is capable of computing a few smallest magnitude eigenvalues and their corresponding left and right eigenvectors of a nonsymmetric matrix using only a small window...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2010
ISSN: 0895-4798,1095-7162
DOI: 10.1137/08073144x